Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer-Dimer Entropy
نویسندگان
چکیده
We derive here the Friedland-Tverberg inequality for positive hyperbolic polynomials. This inequality is applied to give lower bounds for the number of matchings in r-regular bipartite graphs. It is shown that some of these bounds are asymptotically sharp. We improve the known lower bound for the three dimensional monomer-dimer entropy. 2000 Mathematics Subject Classification: 05A15, 05A16, 05C70, 05C80, 82B20
منابع مشابه
Generalized Friedland-Tverberg inequality: applications and extensions
We derive here the Friedland-Tverberg inequality for positive hyperbolic polynomials. This inequality is applied to give lower bounds for the number of matchings in r-regular bipartite graphs. It is shown that some of these bounds are asymptotically sharp. We improve the known lower bound for the three dimensional monomer-dimer entropy. We present Ryser-like formulas for computations of matchin...
متن کاملResults and open problems in matchings in regular graphs
This survey paper deals with upper and lower bounds on the number of k-matchings in regular graphs on N vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower bounds we first survey the known results for bipartite graphs, and their continuous versions as the van der Waerden and Tverberg permanent conjectures and its var...
متن کاملEla Results and Open Problems in Matchings in Regular Graphs
This survey paper deals with upper and lower bounds on the number of k-matchings in regular graphs on N vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower bounds we first survey the known results for bipartite graphs, and their continuous versions as the van der Waerden and Tverberg permanent conjectures and its var...
متن کاملValidations of the Asymptotic Matching Conjectures
In this paper we review the asymptotic matching conjectures for rregular bipartite graphs, and their connections in estimating the monomerdimer entropies in d-dimensional integer lattice and Bethe lattices. We prove new rigorous upper and lower bounds for the monomer-dimer entropies, which support these conjectures. We describe a general construction of infinite families of r-regular tori graph...
متن کاملOn the validations of the Asymptotic Matching Conjectures
In this paper we review the asymptotic matching conjectures for rregular bipartite graphs, and their connections in estimating the monomerdimer entropies in d-dimensional integer lattice and Bethe lattices. We prove new rigorous upper and lower bounds for the monomer-dimer entropies, which support these conjectures. We describe a general construction of infinite families of r-regular tori graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 17 شماره
صفحات -
تاریخ انتشار 2008